Intra-rack and inter-rack erasure code distribution

ABSTRACT

Methods, computing systems and computer program products implement embodiments of the present invention that include detecting multiple sets of storage objects stored in a data facility including multiple server racks, each of the server racks including a plurality of server computers, each of the storage objects in each set being stored in a separate one of the server racks and including one or more data objects and one or more protection objects. A specified number of the storage objects are identified in a given server rack, each of the identified storage objects being stored in a separate one of the server computers, and one or more server computers in the given server rack not storing any of the identified storage objects are identified. Finally, in the identified one or more server computers, an additional protection object is created and managed for the identified storage objects.

FIELD OF THE INVENTION

The present invention relates generally to erasure codes andspecifically to local recovery for distributed erasure codes.

BACKGROUND

Erasure coding is a technique used to greatly reduce storage spacerequired to safely store a dataset. For example, compared to three-waydata replication that has an overhead of 200% and can survive twofailures, a 10:4 Reed-Solomon erasure correction code (which divides thedata into ten blocks and adds four parity blocks) has an overhead of 40%and can survive four failures. To maximize survivability, each of thereplicas or different blocks of the erasure coded data are placed indifferent failure domains, where a failure domain at scale would bedifferent racks or even different aisles within a data center.Typically, the distribution of replicas or blocks is implemented in adeclustered configuration, in order that that the data on a givenstorage device can be protected by a large number of other storagedevices.

To recover from a failure with simple replication, data from a survivingreplica is read. In other words, the amount of data that must be read torecover from a storage device failure (the most common non-transientfailure) is the amount of data that was on the failed device. At scale,where a failure domain is a rack, the amount of data that must cross theaggregation network switches between the racks is proportional to thedata on the failed drive. By contrast, with k:r erasure coding, theamount of data that must be read and transferred over the aggregationswitches is k times the amount of data on the failed device.

The description above is presented as a general overview of related artin this field and should not be construed as an admission that any ofthe information it contains constitutes prior art against the presentpatent application.

SUMMARY

There is provided, in accordance with an embodiment of the presentinvention a method, including detecting multiple sets of storage objectsstored in a data facility including multiple server racks, each of theserver racks including a plurality of server computers, each of thestorage objects in each given set being stored in separate server racksand including one or more data objects and one or more protectionobjects for the given set, identifying, in a given server rack, aspecified number of the storage objects, each of the identified storageobjects being stored in separate server computers, identifying one ormore server computers in the given server rack not storing any of theidentified storage objects, and creating and managing, in the identifiedone or more server computers, an additional protection object for theidentified storage objects.

There is also provided, in accordance with an embodiment of the presentinvention an storage facility, including multiple server racks, each ofthe server racks including a plurality of server computers, and aprocessor configured to detect multiple sets of storage objects, each ofthe storage objects in each given set being stored in separate serverracks and including one or more data objects and one or more protectionobjects for the given set, to identify, in a given server rack, aspecified number of the storage objects, each of the identified storageobjects being stored in separate server computers, to identify one ormore server computers in the given server rack not storing any of theidentified storage objects, and to create and manage, in the identifiedone or more server computers, an additional protection object for theidentified storage objects.

There is further provided, in accordance with an embodiment of thepresent invention a computer program product, the computer programproduct including a non-transitory computer readable storage mediumhaving computer readable program code embodied therewith, the computerreadable program code including computer readable program codeconfigured to detect multiple sets of storage objects stored in a datafacility including multiple server racks, each of the server racksincluding a plurality of server computers, each of the storage objectsin each given set being stored in separate server racks and includingone or more data objects and one or more protection objects for thegiven set, computer readable program code configured to identify, in agiven server rack, a specified number of the storage objects, each ofthe identified storage objects being stored in separate servercomputers, computer readable program code configured to identify one ormore server computers in the given server rack not storing any of theidentified storage objects, and computer readable program codeconfigured to create and manage, in the identified one or more servercomputers, an additional protection object for the identified storageobjects.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosure is herein described, by way of example only, withreference to the accompanying drawings, wherein:

FIGS. 1A-1C are block diagrams of a data facility configured to performlocal recovery using distributed erasure correction codes, in accordancewith an embodiment of the present invention;

FIG. 2 is a block diagram detailing a first given storage object storedin the data facility and configured as a data object, in accordance witha first embodiment of the present invention;

FIG. 3 is a block diagram detailing a second given storage object storedin the data facility and configured as a protection object, inaccordance with a second embodiment of the present invention;

FIG. 4 is a block diagram showing sets of the storage objects stored inthe storage facility, in accordance an embodiment of the presentinvention;

FIG. 5 is a flow diagram that schematically illustrates a method ofcreating and managing intra-rack erasure correction codes in the datafacility, in accordance an embodiment of the present invention;

FIG. 6 is a block diagram showing a first distribution of the storageobjects among server computers in the data facility prior to creatingintra-rack protection objects, in accordance with an embodiment of thepresent invention; and

FIG. 7 is a block diagram showing a second distribution of the storageobjects among the server computers in the data facility subsequent tocreating intra-rack protection objects, in accordance with an embodimentof the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS Overview

Data centers such as cloud data centers typically comprise multipleserver racks, wherein each rack comprises multiple server computers, andwherein each of the server computers comprises one or more storagedevices. Typically, replication or erasure coding is used to protectindividual storage objects on the storage devices. These individualstorage objects can be either replicated or divided into storage units(i.e., physical blocks of data), and protected by a set of linearequations performed on data in the storage units.

Each of the server racks typically comprises a plurality of servercomputers connected to a top-of-rack network switch. The multiple serverracks can be connected via an aggregation switch to communicate withserver computers in other server racks. Typically, intra rack bandwidthis higher and more plentiful than inter-rack bandwidth.

Embodiments of the present invention provide methods and systems forcombining inter-rack (i.e., cross failure zone) erasure coding ofindividual storage objects using orthogonal inter-object, intra-rackerasure coding. Using orthogonal inter-object, intra-rack erasure codingenables recovering from a single storage failure based upon data storedin the same server rack as the failed storage device. This may reducethe inter-rack bandwidth to a bandwidth that is less than or equal tothe bandwidth for replication (i.e., there may be a need to transfer thedata via the aggregation switch if the data is to be recovered in adifferent server rack).

Systems can implement embodiments describe herein with either a smallincrease in space overhead or a small decrease in resiliency. Forexample, implementing 10:3 inter-rack resiliency plus one failureintra-rack resiliency can enable as storage facility to survive fourstorage device failures but only enable the facility to survive threeserver rack failures.

System Description

FIGS. 1A-1C, referred to collectively as FIG. 1, are block diagrams of astorage facility 20 configured to perform local recovery usingdistributed erasure correction codes, in accordance with an embodimentof the present invention. Facility 20 comprises a local data center 22and a cloud data center 24 that communicate via Internet 26.

Local data center 22 comprises one or more host computers (e.g.,database servers and/or e-mail servers) and a management system 30 thancommunicate via a local area network (LAN) 31. LAN 31 couples local datacenter 22 to Internet 26.

Management system comprises a management processor 32 and a managementmemory 34. Processor 32 executes an erasure correction code (ECC)management application 36 from memory 34. In operation, ECC managementapplication 36 manages the distributed erasure correction codes, asdescribed hereinbelow.

Cloud data center 24 comprises multiple server racks 38. In the exampleshown in FIG. 1, server racks 38 and their respective components can bedifferentiated by appending a letter to the identifying numeral, so thatthe server racks comprise server racks 38A-38D. Server racks 38A and 38Bcommunicate via an aggregation switch 40, and server racks 38C and 38Dcommunicate via an aggregation switch 42. Aggregation switches 40 and 42communicate via a data center switch 44 that also coupled cloud datacenter 24 to Internet 26.

Each server rack 38 comprises a top-of-rack switch (TOR) 46, andmultiple server computers 48. In a given server rack 38, servercomputers 48 communicate with each other via top-of-rack switch 46,which is also coupled to a given aggregation switch (i.e., switch 40 or42, depending on the given server rack). Typically intra-rack bandwidth(i.e., bandwidth between two server computers in the same server rack 38that communicate via switch 46) is higher and more plentiful thaninter-rack bandwidth (i.e., bandwidth between two server computers indifferent server racks 38 that communicate via switch 40).

Each server computer 48 comprises a server processor 50, a server memory52, and one or more storage devices 54 such as hard disks andsolid-state disks that store storage objects 56, which are described indetail hereinbelow. In the configuration shown in FIG. 1, storage device54A stores storage object 56A that is also referred to herein as storageobject A1, storage device 54B stores storage object 56B that is alsoreferred to herein as storage object R1, storage device 54C storesstorage object 56C that is also referred to herein as storage object C1,storage device 54D stores storage object 56D that is also referred toherein as storage object B1, storage device 54G stores storage object56G that is also referred to herein as storage object B2, storage device54H stores storage object 56H that is also referred to herein as storageobject C2, storage device 54I stores storage object 56I that is alsoreferred to herein as storage object A2, storage device 54J storesstorage object 56H that is also referred to herein as storage object R2,storage device 54K stores storage object 56K that is also referred toherein as storage object B3, storage device 54M stores storage object56M that is also referred to herein as storage object A3, storage device54N stores storage object 56N that is also referred to herein as storageobject R3, storage device 54O stores storage object 56O that is alsoreferred to herein as storage object C3, storage device 54P storesstorage object 56P that is also referred to herein as storage object R4,storage device 54Q stores storage object 56Q that is also referred toherein as storage object C4, storage device 54S stores storage object56S that is also referred to herein as storage object A4, and storagedevice 54T stores storage object 56T that is also referred to herein asstorage object B4.

In the example shown in FIG. 1, there are three objects A (comprisingstorage objects A1-A4), B (comprising storage objects B1-B4) and C(comprising storage objects C1-C4), and cloud data center 24 implementsan inter-rack 2:2 erasure code so that each of the objects comprises twodata objects and two protection objects. While the example in FIG. 1shows an inter-rack 2:2 erasure code for sake of simplicity, any k:rcode is considered to be within the spirit and scope of the presentinvention.

As described in the description referencing FIGS. 2 and 3 hereinbelow,storage objects 56 storing user data may also be referred to herein asdata objects 56, and storage objects storing protection data such aserasure correction codes may also be referred to herein as protectionobjects 56.

Additionally, protection objects 56 that protect storage objects thatare stored in different server racks 38 may also be referred to hereinas inter-rack protection objects 56, and protection objects 56 thatprotect storage objects that are stored in different server computers 48in a given server rack may also be referred to herein as intra-rackprotection objects 56.

Therefore, in the example:

-   -   Storage objects A1 and A2 are the two data objects 56 of object        A, and A3 and storage objects A4 are the two protection objects        56 (e.g., parity blocks) of object A.    -   Storage objects B1 and B2 are the two data objects 56 of object        B, and storage objects B3 and B4 are the two protection objects        56 of object B.    -   Storage objects C1 and C2 are the two data objects 56 of object        C, and storage objects C3 and C4 are the two protection objects        56 of object C.

To enable recovery of a single failed storage object without resultingin extensive inter-rack communication, embodiments of the presentinvention add an intra-rack protection object RN (i.e., a givenprotection object 56), which processor 32 can construct from a linearfunction of a collection of storage objects 56 within a given serverrack 38 so that all of the storage objects are on different servercomputers 48 (i.e., different storage devices 54). To recover from asingle failure of a given server computer 48 or a given storage device54 (e.g., storage device 54C containing storage object C1), processor 32can read storage objects A1, R1, and B1, apply the inverse of the linearfunction used to construct protection object R1, thereby rebuildingstorage object C1. While rebuilding storage object C1, the onlyinter-rack communication required is if the rebuilt storage object C1should be placed on another rack.

In order to protect against a failure of a given server computer 48, thestorage objects in a given server rack 38 that are combined using alinear function to create a given inter-rack protection object 56typically need to reside on distinct server computers 48.

Additionally, if the protection objects comprise any linear codes (e.g.Reed Solomon codes), the codes typically need to have the same size. Insystems where this is not the case, this can be handled in a differentways, for example (a) padding the smaller storage objects 56 to bringthem to the same size as the others, since zero padding does not changethe storage object's parity and can be implemented with negligibleincrease of physical footprint, and/or (b) combining smaller storageobjects to make a larger storage object 56, (i.e., since a bin packingalgorithm can be used to do this efficiently in terms of space usage orother factors).

Furthermore, the width of a given intra-rack protection object 56 may beless than or equal to the number of server computers in a given serverrack 38.

FIG. 2 is a block diagram detailing storage object 56A, in accordancewith a first embodiment of the present invention, and FIG. 3 is a blockdiagram detailing storage object 56N, in accordance with a secondembodiment of the present invention. Storage objects 56 comprisemultiple storage units 60 that comprise physical blocks of data onstorage devices 54. Since storage units 60 in storage object 56Acomprise user data, storage object 56A may also be referred to as dataobject 56A. Likewise, since storage units 60 storage object 56N compriseerasure correction codes, storage object 56N may also be referred to asprotection object 56N.

In operation, processor 32 manages a given protection object 56 formultiple storage objects 56 by calculating an erasure correction codesfor corresponding contents in the multiple storage objects. For a givendata object 56, the contents comprise user data, and for a givenprotection object 56, the contents comprise erasure correction codes.

While embodiments herein describe protection objects 56 using erasurecorrection codes, other error correction mechanism are considered to bewithin the spirit and scope of the present invention. For example agiven protection object 56 (i.e., either intra-rack or inter-rack) maycomprise a replication of a given data object.

In embodiments described herein, processor 32 creates and managesintra-rack protection objects 56. In some embodiments, local data center22 can configure management system 30 to intercept write request fromhost computer 28, and update the intra-rack protection objects 56 asnecessary. In alternative embodiments, processor 32 can monitor dataobjects 56, and update intra-rack protection objects 56 as necessary. Infurther embodiments, the functionality of management system 30 can beperformed by a given server processor 50, or by a virtual machineinstance executing in a given memory 52. Additionally, while embodimentsherein describe creating a single intra-rack protection object 56 for agiven server rack 38, creating and managing multiple intra-rackprotection objects for a given server rack 38 is considered to be withinthe spirit and scope of the present invention.

Processors 32 and 50 typically comprise general-purpose computer, whichare programmed in software to carry out the functions described herein.The software may be downloaded to system 22 and server computers 48 inelectronic form, over a network, for example, or it may be provided onnon-transitory tangible media, such as optical, magnetic or electronicmemory media. Alternatively, some or all of the functions of processors32 and 50 may be carried out by dedicated or programmable digitalhardware components, or using a combination of hardware and softwareelements.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

These computer readable program instructions may also be stored in acomputer readable storage medium that can direct a computer, aprogrammable data processing apparatus, and/or other devices to functionin a particular manner, such that the computer readable storage mediumhaving instructions stored therein comprises an article of manufactureincluding instructions which implement aspects of the function/actspecified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

Intra-Rack Erasure Correction Codes

FIG. 4 is a block diagram showing sets 70 of the storage objects storedin the storage facility, in accordance an embodiment of the presentinvention. In the example shown in FIG. 4, sets can be differentiated byappending a letter to the identifying numeral, so that the sets compriseserver racks 70A-70C.

Set 70A represents object A and comprises storage objects A1, A2, A3 andA4. Set 70B represents object B and comprises storage objects B1, B2, B3and B4. Set 70C represents object C and comprises storage objects C1,C2, C3 and C4. As described supra, storage objects A1, A2, B1, B2, C1,and C2 comprise data objects 56, and storage objects A3, A4, B3, B4, C3,and C4 comprise (inter-rack) protection objects 56.

FIG. 5 is a flow diagram that schematically illustrates a method ofcreating and managing intra-rack protection objects 56, in accordance anembodiment of the present invention. In a detection step 80, processor32 detects multiple sets 70. As described supra, each set 70 comprisesone or more data objects 56 and one or more protection objects 56, eachof the data and the protection objects stored on separate server racks38. For example, set 70A comprises data object 56A that is stored inserver rack 38A, data object 56B that is stored in server rack 38B, dataobject 56C that is stored in server rack 38C, and data object 56D thatis stored in server rack 38D. Protection objects 56C and 56D protect70A. In other words, if a given storage object 56 in set 70A cannot beread, then contents of the given storage object can be recovered usingdata stored the other storage objects in set 70A.

In a first identification step 82, processor 32 identifies, in a givenserver rack 38, a specified number of storage objects that are stored inseparate server computers in the given server rack. For example, if thespecified number is three and the given server rack is server rack 38A,then the identified storage objects comprise storage objects A1, B1 andC1.

In a second identification step 84, processor 32 identifies, in thegiven server rack, one or more server computers 48 not storing any ofthe identified storage objects. For example, in the configuration shownin FIG. 1, processor can identify either server computer 48B or servercomputer 48E. Finally, in a creation step 86, using embodimentsdescribed herein, processor 32 creates and manages, on each of the oneor more identified server computers, an additional protection object 56that is configured to protect the identified storage objects, and themethod ends. To create the one or more additional protection objects,processor 32 calculates erasure correction codes based on contents ofthe identified storage objects, and to manage the one or more additionalprotection objects, the management processor updates the erasurecorrection codes upon detecting any changes to the identified storageobjects.

The additional protection object protects the identified storage objectsin the given rack. For example, in rack 38A, protection object R1protects storage objects A1, B1, C1 and D1, and storage objects A1, B1,C1, D1 and E1 can be referred to as a rack set. Therefore, if a givenstorage object 56 in the rack set cannot be read, contents of the givenstorage object can be recovered using data stored in the other storageobjects 56 in the rack set.

FIG. 6 is a block diagram showing a first distribution of storageobjects 56 among server computers 48 prior to performing the stepsdescribed in FIG. 5, in accordance with an embodiment of the presentinvention. In FIG. 6, the storage objects comprise sets 70A, 70B and70C.

FIG. 7 is a block diagram showing a second distribution of storageobjects 56 among server computers 48 in the data facility subsequent toperforming the steps described in FIG. 5, in accordance with anembodiment of the present invention. In addition to sets 70A-70C, FIG. 7shows protection objects R1, R2, R3 and R4 stored in each server rack38.

In operation, processor 32 can maintain a list of storage objects withineach rack 38 that are candidates for intra-rack erasure coding,including their sizes and respective server computers 48 and/or storagedevices 54. Facility 20 can maintain a “rack candidate list” usingcentralized or distributed logic.

In some embodiments, processor 32 can create the additional intra-rackparity objects can be created in a “lazy” manner, because while theirpresence reduces the amount of inter-rack communication needed forrecovery, recovery is possible without them. Therefore, processor 32does not need to create the additional intra-rack protection objectscreated immediately, (or at all), and can be created in any of thefollowing scenarios:

-   -   Processor 32 detects a suitable set of similarly sized storage        units 60 available on a distinct server computer 48.    -   Processor 32 detects sufficient system resources to read the        storage objects, compute the erasure correction codes and store        the computed codes.    -   Processor 32 determines if workload parameters suggest that        creating the intra-rack protection objects is beneficial to the        facility.

Another enhancement for “lazy” intra-rack parity creation comprisessupporting both lazy and immediate protection object creation. Processor32 can use the lazy mechanism will be used as a default, but in case ofdata compromise in the cloud data center, the management processor canupgrade some of the protection object creation operations to beperformed immediately.

For example, if a failure occurred in a first server rack (e.g., rack38A) before processor 32 created intra-rack protection object R1, thenprocessor 32 can regenerate the missing data form a second server rack38 (e.g., rack 38B). At this point, processor 32 can quickly upgrade theinternal parity creation of any relevant storage objects 56 in thesecond server rack, thereby reducing a probability of data loss due to apotential failure in the second server rack. Note that this expeditedprotection block creation should not interfere with the recovery of datato the first rack, since both processes attempt to read the sameaffected data from a given storage device in the second rack, and thuscan “piggyback” their respective reads.

In operation, intra-rack protection is based upon data that isindependent from any inter-rack parity protection. Therefore, the samelogic in ECC management application 36 can be used for both intra-rackand inter-rack protection without loss of redundancy.

In some embodiments, overwriting or migrating given storage object 56 isequivalent to deleting the given storage object and creating a newstorage object. If a given storage object 56 is deleted, may result inits respective erasure correction codes in a given inter-rack protectionobject 56 also being deleted. However, since each of these inter-rackblocks now also belongs to given intra-rack protection object 56. Tohandle this situation, processor 32 can perform one of the followingalternative operations:

-   -   “A”. Abandon the given intra-rack protection object, delete the        protection object's erasure correction codes, and return the        other erasure correction codes that were in the given intra-rack        protection object to the server rack's candidate list.    -   “B”. Maintain the given intra-rack protection object, mark the        given protection object's storage units 60 as deleted but retain        the given protection object's erasure correction codes to        support the other storage objects 56 in the codes.    -   “C”. Apply operation “A” described hereinabove if a certain        percentage of the erasure correction codes in the given        protection object have been deleted. Otherwise apply operation        “B” described hereinabove.    -   “D”. Place the intra-rack given protection object on a list for        rebuilding. Therefore, when new additional storage objects 56        (i.e., storage units 60) are available on a given storage device        54 that previously stored the deleted storage object, use the        new storage objects as a replacement for the intra-rack        protection object.    -   “E”. Replace the deleted storage objects with a known fixed byte        sequence and delete the storage object. This reduces the        efficiency of the intra-rack encoding but does not “waste” space        for storing a deleted storage object 56.

These alternative operations typically trade off space usage for CPU andI/O resources. Additionally, in order to improve reliability, multiplepolicies can be defined for prioritizing the inclusion of storageobjects 56 into a given intra-rack protection object. These policies mayinclude:

-   -   Assigning higher importance to frequently accessed data objects        56.    -   Assigning higher importance to de-duplicated storage objects 56,        since losing a given de-duplicated storage objects 56 may result        in losing all the storage objects that refer to it.    -   User-specific service level agreements (SLAs) can be used for        prioritization.

The flowchart(s) and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

It will be appreciated that the embodiments described above are cited byway of example, and that the present invention is not limited to whathas been particularly shown and described hereinabove. Rather, the scopeof the present invention includes both combinations and subcombinationsof the various features described hereinabove, as well as variations andmodifications thereof which would occur to persons skilled in the artupon reading the foregoing description and which are not disclosed inthe prior art.

1. A method, comprising: detecting, by a management processor, multiplesets of storage objects stored in a data facility comprising multipleserver racks, each of the server racks comprising a plurality of servercomputers, each of the storage objects in each given set being stored inseparate server racks and comprising one or more data objects and one ormore protection objects for the given set; identifying, by themanagement processor, in a given server rack, a specified number of thestorage objects, each of the identified storage objects being stored inseparate server computers; identifying by the management processor, oneor more server computers in the given server rack not storing any of theidentified storage objects; and creating and managing, by the managementprocessor, in the identified one or more server computers, an additionalprotection object for the identified storage objects, wherein themultiple server racks are coupled via one or more first network switcheshaving one or more respective first bandwidths, and wherein each of theserver computers in a given server rack are coupled via a second networkswitch having a second bandwidth, and wherein the second bandwidth isgreater than each of the one or more first bandwidths, and wherein thesecond bandwidth is more plentiful than the first bandwidth.
 2. Themethod according to claim 1, wherein the additional protection objectcomprises a replicated storage object.
 3. (canceled)
 4. The methodaccording to claim 1, wherein the corresponding contents of a givenidentified data object comprises user data.
 5. The method according toclaim 1, wherein the erasure correction codes comprise first erasurecorrection codes, and wherein the corresponding contents of a givenidentified protection object comprises second erasure correction codes.6. (canceled)
 7. The method according to claim 1, wherein each of theone or more first communication switches are selected from a listconsisting of a data center switch and an aggregation switch, andwherein the second communication switch comprises a top-of-rack switch.8. A storage facility, comprising: multiple server racks, each of theserver racks comprising a plurality of server computers; and a processorconfigured: to detect multiple sets of storage objects, each of thestorage objects in each given set being stored in separate server racksand comprising one or more data objects and one or more protectionobjects for the given set, to identify, in a given server rack, aspecified number of the storage objects, each of the identified storageobjects being stored separate server computers, to identify one or moreserver computers in the given server rack not storing any of theidentified storage objects, and to create and manage, in the identifiedone or more server computers, an additional protection object for theidentified storage objects, wherein the multiple server racks arecoupled via one or more first network switches having one or morerespective first bandwidths, and wherein each of the server computers ina given server rack are coupled via a second network switch having asecond bandwidth, and wherein the second bandwidth is greater than eachof the one or more first bandwidths, and wherein the second bandwidth ismore plentiful than the first bandwidth.
 9. The storage facilityaccording to claim 8, wherein the additional protection object comprisesa replicated storage object.
 10. (canceled)
 11. The storage facilityaccording to claim 8, wherein the corresponding contents of a givenidentified data object comprises user data.
 12. The storage facilityaccording to claim 8, wherein the erasure correction codes comprisefirst erasure correction codes, and wherein the corresponding contentsof a given identified protection object comprises second erasurecorrection codes.
 13. (canceled)
 14. The storage facility according toclaim 8, wherein each of the one or more first communication switchesare selected from a list consisting of a data center switch and anaggregation switch, and wherein the second communication switchcomprises a top-of-rack switch.
 15. A computer program product, thecomputer program product comprising: a non-transitory computer readablestorage medium having computer readable program code embodied therewith,the computer readable program code comprising: computer readable programcode configured to detect multiple sets of storage objects stored in adata facility comprising multiple server racks, each of the server rackscomprising a plurality of server computers, each of the storage objectsin each given set being stored in separate server racks and comprisingone or more data objects and one or more protection objects for thegiven set; computer readable program code configured to identify, in agiven server rack, a specified number of the storage objects, each ofthe identified storage objects being stored in separate servercomputers; computer readable program code configured to identify one ormore server computers in the given server rack not storing any of theidentified storage objects; and computer readable program codeconfigured to create and manage, in the identified one or more servercomputers, an additional protection object for the identified storageobjects, wherein the multiple server racks are coupled via one or morefirst network switches having one or more respective first bandwidths,and wherein each of the server computers in a given server rack arecoupled via a second network switch having a second bandwidth, andwherein the second bandwidth is greater than each of the one or morefirst bandwidths, and wherein the second bandwidth is more plentifulthan the first bandwidth, and wherein each of the one or more firstcommunication switches are selected from a list consisting of a datacenter switch and an aggregation switch, and wherein the secondcommunication switch comprises a top-of-rack switch.
 16. The computerprogram product according to claim 15, wherein the additional protectionobject comprises a replicated storage object.
 17. (canceled)
 18. Thecomputer program product according to claim 15, wherein thecorresponding contents of a given identified data object comprises userdata.
 19. The computer program product according to claim 15, whereinthe erasure correction codes comprise first erasure correction codes,and wherein the corresponding contents of a given identified protectionobject comprises second erasure correction codes.
 20. (canceled)